Performance Analysis of Cluster Based Routing Scheme in Wireless Sensor Network

Wireless Sensor Networks have formed new opportunities across the variety of human efforts including engineering design, forest fire tracking, and battlefield surveillance. It is a group of sensor nodes that comprised of sensing, computing, and communication elements that gives an administrator the ability to observe and react to events and phenomena in a specified environment. Minimizing Energy consumption is considered as one of the most important principles in the development of routing protocols for Wireless Sensor Networks (WSN). This research paper describes the characteristics of hierarchical routing scheme for sensor network Low Energy Adaptive Clustering hierarchy (LEACH) and Location Aware Cluster Based Routing Protocol (LACBRP) based on the performance matrices like Energy Values, Latency Values, Packet Delivery Ratio and Residual Energy Values. This comparative study proves that LACBRP performs well than LEACH routing scheme. Keyword: WSN, Energy Values, Latency Values, Packet Delivery Ratio, Residual Energy Values Performance Analysis of Cluster Based Routing Scheme in Wireless Sensor Network 292 Aware Cluster Based Routing (LACBRP) which are the part of network structure protocol is carried out. Energy consumption and network life time has been considered as the major issues wireless sensor network (WSN) requires a huge breadth of knowledge from an enormous variety of disciplines, so its study becomes challenging [1]. This paper is categorized as follows. Section I presents the Introduction. Section II provides the overview of Routing protocols. Section III describes the simulation environment .Section IV presents the Experimental results and Section V concludes the paper. II. OVERVIEW OF ROUTING PROTOCOLS LEACH: It is Dynamic Hierarchical Routing for sensor network, called Low Energy Adaptive Clustering Hierarchy (LEACH). A routing protocol is considered adaptive if certain system parameters can be restricted in order to adapt to current network conditions and available energy levels. LEACH randomly selects a few sensor nodes as cluster heads (CHs) and rotates this role to evenly share out the energy load among the sensors in the network. In LEACH, the CH nodes compress data arriving from nodes that belong to the respective cluster, and send an aggregated packet to the BS in order to reduce the amount of information that must be transmitted to the BS. LEACH uses a TDMA/code division multiple access (CDMA) MAC to reduce inter cluster and intra-cluster collisions. However, data collection is centralized and performed periodically. Therefore, this protocol is most appropriate when there is a need for constant monitoring by the sensor network. A user may not need all the data immediately. Hence, periodic data transmissions are unnecessary, and may drain the limited energy of the sensor nodes. After a given interval of time, randomized rotation of the role of CH is conducted so that uniform energy dissipation in the sensor network is obtained. The operation of LEACH is separated into two phases, the setup phase and the steady state phase. In the setup phase, the clusters are organized and CHs are selected. In the steady state phase, the actual data transfer to the BS takes place. The duration of the steady state phase is longer than the duration of the setup phase in order to minimize overhead. During the setup phase, a predetermined fraction of nodes, p, elect themselves as CHs as follows. A sensor node chooses a random number, r, between 0 and 1. If this random number is less than a Threshold value, T(n), the node becomes a CH for the current round. The threshold value is calculated based on an equation that incorporates the desired percentage to become a CH, the current round, and the set of nodes that have not been selected as a CH in the last (1/p) rounds denoted as G. it is given by: T (n) = (p/(1-p(mod(1/p)))) if n € G where G is the set of nodes that are involved in the CH election. All elected CHs broadcast an advertisement message to the rest of the nodes in the network that they are the new CHs. All the non -CH nodes, after receiving this advertisement, decide on the cluster to which they want to belong. This decision is based on the signal strength of the advertisement. The non-CH nodes inform the appropriate CHs that they will be a member of the cluster. After receiving all the messages from the nodes that would like to be included in the cluster and based on the number of nodes in the cluster, the CH node creates a TDMA schedule and assigns each node a time slot when it can transmit. This schedule is broadcast to all the nodes in the cluster. During the steady state phase, the sensor nodes can begin sensing and transmitting data to the CHs. The CH node, after receiving all the data, aggregates it before sending it to the BS. After a certain time, which Hrituparna Paul and Prodipto Das 293 is determined a priori, the network goes back into the setup phase again and enters another round of selecting new CHs. Each cluster communicates using different CDMA codes to reduce interference from nodes belonging to other clusters. Limitation: It is not applicable to networks deployed in large regions. It also assumes that nodes always have data\ to send, and nodes located close to each other have correlated data. It is not obvious how the number of predetermined CHs (p) is going to be uniformly distributed through